Maximum dispersion problem in dense graphs
نویسنده
چکیده
In this note, we present a polynomial-time approximation scheme for a “dense case” of dispersion problem in weighted graphs, where weights on edges are integers from {1; : : : ; K} for some xed integer K . The algorithm is based on the algorithmic version the regularity lemma. c © 2000 Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
Improving the Maximum-Weight Clique Algorithm for the Dense Graphs
In this paper we present a fast algorithm for the maximum-weight clique problem on arbitrary undirected graphs, which is improved for the dense graphs. The algorithm uses colour classes and backtracking techniques inside itself in parallel in a form of a branch and bound algorithm. The algorithm contains also several improvements for the most complex case, which are dense graphs. Computational ...
متن کاملA New Exact Algorithm for the Maximum Weight Clique Problem
Given an undirected graph with weight for each vertex, the maximum weight clique problem is to find the clique of the maximum weight. Östergård proposed a fast exact algorithm for solving this problem. We show his algorithm is not efficient for very dense graphs. We propose an exact algorithm for the problem, which is faster than Östergård’s algorithm in case the graph is dense. We show the eff...
متن کاملImproved approximation for spanning star forest in dense graphs
A spanning subgraph of a graph G is called a spanning star forest of G if it is a collection of node-disjoint trees of depth at most 1. The size of a spanning star forest is the number of leaves in all its components. The goal of the spanning star forest problem is to find the maximum-size spanning star forest of a given graph. In this paper, we study the spanning star forest problem on c-dense...
متن کاملNP-Hardness of the Bandwidth Problem on Dense Graphs
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum diierence between the numbers of adjacent vertices is minimal. The problem has a long and varied history and is known to be NP-hard Papadimitriou Pa 76]. Recently for dense graphs a constant ratio approximation algorithm for this problem has been constructed in Karpinski, Wirtgen and Ze-likov...
متن کاملOn Solving the Maximum $k$-club Problem
Given a simple undirected graph G, the maximum k-club problem is to find a maximum-cardinality subset of nodes inducing a subgraph of diameter at most k in G. This NP-hard generalization of clique, originally introduced to model low diameter clusters in social networks, is of interest in network-based data mining and clustering applications. We give two MAX-SAT formulations of the problem and s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 27 شماره
صفحات -
تاریخ انتشار 2000